Path Transferability of Planar Graphs
نویسندگان
چکیده
We regard a path as a train moving on a graph. A graph G is called n-transferable if any path of length n can be moved to any other such path by several steps. We will show that every planar graph with minimum degree at least three is at most 10 transferable.
منابع مشابه
Local Structures in Polyhedral Maps on Surfaces, and Path Transferability of Graphs
We extend Jendrol’ and Skupień’s results about the local structure of maps on the 2-sphere: In this paper we show that if a polyhedral map G on a surface M of Euler characteristic χ(M) ≤ 0 has more than 126|χ(M)| vertices, then G has a vertex with ”nearly” non-negative combinatorial curvature. As a corollary of this, we can deduce that path transferability of such graphs are at most 12. keyword...
متن کامل$n$-Array Jacobson graphs
We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.
متن کاملPath-Additions of Graphs
Path-addition is an operation that takes a graph and adds an internally vertex-disjoint path between two vertices together with a set of supplementary edges. Path-additions are just the opposite of taking minors. We show that some classes of graphs are closed under path-addition, including non-planar, right angle crossing, fan-crossing free, quasi-planar, (aligned) bar 1-visibility, and interva...
متن کاملOn the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملShortest Path Computations in S-Graphs
We consider a class of non-planar graphs that arises in VLSI layout compaction and show that a number of shortest path problems on these graphs can be solved in the same time as the corresponding problem in a planar graph.
متن کامل